Consistent parameter clustering: Definition and analysis
نویسنده
چکیده
Parameter clustering is a popular robust estimation technique based on location statistics in a parameter space where parameter samples are obtained from data samples. A problem with clustering methods is that they produce estimates not invariant to transformations of the parameter space. This article presents three contributions to the theoretical study of parameter clustering. First, it introduces a probabilistic formalization of parameter clustering. Second, it uses the formalism to define consistency in terms of a symmetry requirement and to derive criteria for a consistent choice of parameterization. And third, it applies the criteria to the practically relevant cases of motion and pose estimation of three-dimensional shapes. Bias and error statistics on random data sets demonstrate a significant advantage of using a consistent parameterization for rotation clustering. Moreover, clustering parameters of analytic shapes is discussed and a real application example of circle estimation given.
منابع مشابه
Improvement of density-based clustering algorithm using modifying the density definitions and input parameter
Clustering is one of the main tasks in data mining, which means grouping similar samples. In general, there is a wide variety of clustering algorithms. One of these categories is density-based clustering. Various algorithms have been proposed for this method; one of the most widely used algorithms called DBSCAN. DBSCAN can identify clusters of different shapes in the dataset and automatically i...
متن کاملOn Model-Based Clustering, Classification, and Discriminant Analysis
The use of mixture models for clustering and classification has burgeoned into an important subfield of multivariate analysis. These approaches have been around for a half-century or so, with significant activity in the area over the past decade. The primary focus of this paper is to review work in model-based clustering, classification, and discriminant analysis, with particular attenti...
متن کاملNonlinearly Structured Low-Rank Approximation
Polynomially structured low-rank approximation problems occur in • algebraic curve fitting, e.g., conic section fitting, • subspace clustering (generalized principal component analysis), and • nonlinear and parameter-varying system identification. The maximum likelihood estimation principle applied to these nonlinear models leads to nonconvex optimization problems and yields inconsistent estima...
متن کاملAn experimental study of four variants of pose clustering from dense range data
Parameter clustering is a robust estimation technique based on location statistics in a parameter space where parameter samples are computed from data samples. This article investigates parameter clustering as a global estimator of object pose or rigid motion from dense range data without knowing correspondences between data points. Four variants of the algorithm are quantitatively compared reg...
متن کاملA Self-Consistent Technique for the Construction and Evaluation of the Three-Parameter Corresponding States Principles
A self-consistent approach for the evaluation of the existing three-parameter corresponding states principles of non-polar fluids and the calculation of the corresponding states parameters is presented. This self consistent approach is based upon the assumption that the contribution of the third parameter to the thermophysical properties is much smaller than the contributions of the first two p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition Letters
دوره 28 شماره
صفحات -
تاریخ انتشار 2007